BO‘LAJAK XOR RAHBARLARINING IJODIY QOBILIYATLARINI RIVOJLANTIRISH
نویسندگان
چکیده
Mazkur maqolada bo‘lajak xor sinfi o‘qituvchilarining ijodiy qobiliyatlarini rivojlantirishning zaruriyati, usul va vositalari bayon etiladi. Shuningdek mazkur muammoni tadqiq etgan olimlar fikrlari tahlil
منابع مشابه
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
Most implementations of Yao’s garbled circuit approach for 2-party secure computation use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008). We introduce an alternative technique called flexible-XOR (fleXOR) that generalizes free-XOR and offers several advantages. First, fleXOR can be instantiated under a weaker hardness assumption on the underlying cipher/hash function (related-...
متن کاملBalanced XOR-ed Coding
This paper concerns with the construction of codes over GF (2) which reach the max-flow for single source multicast acyclic networks with delay. The coding is always a bitwise XOR of packets with equal lengths, and is based on highly symmetrical and balanced designs. For certain setups and parameters, our approach offers additional plausible security properties: an adversary needs to eavesdrop ...
متن کاملOn Yao's XOR-Lemma
A fundamental lemma of Yao states that computational weakunpredictability of Boolean predicates is amplified when the results of several independent instances are XOR together. We survey two known proofs of Yao’s Lemma and present a third alternative proof. The third proof proceeds by first proving that a function constructed by concatenating the values of the original function on several indep...
متن کاملThe Generalized XOR Lemma
The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of this paper is to extend the XOR Lemma to more general cases where a mapping may not be necessarily regular. The extended XOR Lemma has applications in the design of substitution boxes or S-boxes u...
متن کاملCodes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0, 1, 2}n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ????????-????????? ?????????? ??????? ?????????? / ?????????? ???????? ?????????-???????????? ???? / Actual Problems of Humanities and Social Sciences
سال: 2023
ISSN: ['2181-1342']
DOI: https://doi.org/10.47390/scp1342v3i7y2023n34